Time Analysis of Time Basic Nets Using Strong Time Semantics
نویسندگان
چکیده
Petri nets are a powerful formalism for the specification and verification of concurrent and real-time systems. Real-time systems must be carefully verified because even a small failure in these systems can cause loss of human lives. For this purposes the time reachability analysis of Petri nets with incorporated time issue is more than suitable. The best known and probably the most used Petri nets with incorporated time issue are Time Petri Nets. To perform sophisticated time analyses of systems the Time Basic Nets are far more suitable then Time Petri Nets. This paper presents notions and notations of these nets, their properties and mainly the application of the reachability analysis approach of Time Petri Nets to Time Basic Nets for the purpose of easier time examination.
منابع مشابه
Comparison of the expressiveness w.r.t. timed bisimilarity of k-bounded Arc, Place and Transition Time Petri Nets with weak and strong single server semantics
In this paper, we consider bounded Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal strong and weak semantics of these models in terms of Timed Transition Systems. We compare the expressiveness of the six models w.r.t. (weak) timed bisimilarity (behavioral semantics). The main results of the paper...
متن کاملWeak Time Petri Nets Strike Back!
We consider the model of Time Petri Nets where time is associated with transitions. Two semantics for time elapsing can be considered: the strong one, for which all transitions are urgent, and the weak one, for which time can elapse arbitrarily. It is well known that many verification problems such as the marking reachability are undecidable with the strong semantics. In this paper, we focus on...
متن کاملOn the Compared Expressiveness of Arc, Place and Transition Time Petri Nets
In this paper, we consider safe Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal strong and weak semantics of these models in terms of Timed Transition Systems. We compare the expressiveness of the six models w.r.t. (weak) timed bisimilarity (behavioral semantics). The main results of the paper ar...
متن کاملSoundness of Timed-Arc Workflow Nets in Discrete and Continuous-Time Semantics
Analysis of workflow processes with quantitative aspects like timing is of interest in numerous time-critical applications. We suggest a workflow model based on timed-arc Petri nets and study the foundational problems of soundness and strong (time-bounded) soundness. We first consider the discrete-time semantics (integer delays) and explore the decidability of the soundness problems and show, a...
متن کاملHybrid Time Delay Petri Nets as a Mathematical Novel Tool to Model Dynamic System with Current Sample Time
The existing modeling methods using Petri Nets, have been successfully applied to model and analyze dynamic systems. However, these methods are not capable of modeling all dynamic systems such as systems with the current sample time signals, systems including various subsystems and multi-mode systems. This paper proposes Hybrid Time Delay Petri Nets (HTDPN) to solve the problem. In ...
متن کامل